Edge Metric and Fault-Tolerant Edge Metric Dimension of Hollow Coronoid
نویسندگان
چکیده
منابع مشابه
Edge-fault-tolerant edge-bipancyclicity of hypercubes
In this paper, we consider the problem embedding a cycle into the hypercube Qn with existence of faulty edges and show that for any edge subset F of Qn with |F | n− 1 every edge of Qn − F lies on a cycle of every even length from 6 to 2n inclusive provided n 4 and all edges in F are not incident with the same vertex. This result improves some known results. 2005 Published by Elsevier B.V.
متن کاملFault-Tolerant Metric Vector Routing
We present a distributed routing protocol for obtaining the best path between any pair of nodes in a computer network. The metric to determine the best path between the two nodes is an n-dimensional vector. Each element of the vector is a simple metric, such as hop-count, link cost, link bandwidth, etc.. Given that no path may provide the best value for each of the simple metrics in the vector,...
متن کاملEdge-bipancyclicity of star graphs under edge-fault tolerant
The star graph Sn is one of the most famous interconnection networks. It has been shown by Li [T.-K. Li, Cycle embedding in star graphs with edge faults, Appl. Math. Comput. 167 (2005) 891–900] that Sn contains a cycle of length from 6 to n! when the number of fault edges in the graph does not exceed n 3. In this paper, we improve this result by showing that for any edge subset F of Sn with jFj...
متن کاملThe metric dimension and girth of graphs
A set $Wsubseteq V(G)$ is called a resolving set for $G$, if for each two distinct vertices $u,vin V(G)$ there exists $win W$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum cardinality of a resolving set for $G$ is called the metric dimension of $G$, and denoted by $dim(G)$. In this paper, it is proved that in a connected graph $...
متن کاملEdge-fault-tolerant bipanconnectivity of hypercubes
This paper shows that for any two distinct vertices u and vwith distance d in the hypercube Qn (n P 3) with at most 2n 5 faulty edges and each vertex incident with least two faultfree edges, there exist fault-free uv-paths of length ‘ in Qn for every ‘with dþ 4 6 ‘ 6 2 1 and ‘ d 0 ðmod2Þ. This result improves some known results on edge-fault bipanconnectivity of hypercubes. The proof is based o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2021
ISSN: 2227-7390
DOI: 10.3390/math9121405